package leetcode.code1832;

import java.util.HashSet;
import java.util.Set;
import java.util.StringJoiner;

public class Solution2 {

	public boolean checkIfPangram(String sentence) {
		int set = 0;
		for (int i = 0; i < sentence.length() && set != 0b11111111111111111111111111; i++) {
			set = 1 << sentence.charAt(i) - 'a' | set;
		}
		return set == 0b11111111111111111111111111;
	}
	
	public static void main(String[] args) {
		System.out.println(Long.MAX_VALUE);
		StringJoiner sj = new StringJoiner("|");
		sj.add("1").add("2");
		System.out.println(sj.toString());
	}

}
